Randomly trapped random walks on Zd
نویسندگان
چکیده
منابع مشابه
RANDOM WALKS IN Zd AND THE DIRICHLET PROBLEM
Random walks can be used to solve the Dirichlet problem – the boundary value problem for harmonic functions. We begin by constructing the random walk in Z and showing some of its properties. Later, we introduce and examine harmonic functions in Z in order to set up the discrete Dirichlet problem. Finally, we solve the Dirichlet problem using random walks. Throughout the paper, we discuss connec...
متن کاملRandom walks colliding before getting trapped
Let P be the transition matrix of a finite, irreducible and reversible Markov chain. We say the continuous time Markov chain X has transition matrix P and speed λ if it jumps at rate λ according to the matrix P . Fix λX , λY , λZ ≥ 0, then let X,Y and Z be independent Markov chains with transition matrix P and speeds λX , λY and λZ respectively, all started from the stationary distribution. Wha...
متن کاملRandomly charged polymers, random walks, and their extremal properties.
Motivated by an investigation of ground state properties of randomly charged polymers, we discuss the size distribution of the largest Q–segments (segments with total charge Q) in such N–mers. Upon mapping the charge sequence to one–dimensional random walks (RWs), this corresponds to finding the probability for the largest segment with total displacement Q in an N–step RW to have length L. Usin...
متن کاملA Local Limit Theorem for Random Walks in Random Scenery and on Randomly Oriented Lattices
Random walks in random scenery are processes defined by Zn := ∑n k=1 ξX1+...+Xk , where (Xk, k ≥ 1) and (ξy, y ∈ Z) are two independent sequences of i.i.d. random variables. We assume here that their distributions belong to the normal domain of attraction of stable laws with index α ∈ (0, 2] and β ∈ (0, 2] respectively. These processes were first studied by H. Kesten and F. Spitzer, who proved ...
متن کاملRandomly biased walks on subcritical trees
As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen, independently for distinct edges, according to a law that satisfies a logarithmic non-lattice condition. The mean return time of the walk is in essence given by the t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2015
ISSN: 0304-4149
DOI: 10.1016/j.spa.2014.10.002